Chain recurrence and discretisation
نویسندگان
چکیده
منابع مشابه
Chain Recurrence Rates and Topological Entropy
We investigate the properties of chain recurrent, chain transitive, and chain mixing maps (generalizations of the wellknown notions of non-wandering, topologically transitive, and topologically mixing maps). We describe the structure of chain transitive maps. These notions of recurrence are defined using ε-chains, and the minimal lengths of these ε-chains give a way to measure recurrence time (...
متن کاملAn Algorithmic Approach to Chain Recurrence
In this paper we give a new definition of the chain recurrent set of a continuous map using finite spatial discretizations. This approach allows for an algorithmic construction of isolating blocks for the components of Morse decompositions which approximate the chain recurrent set arbitrarily closely as well as discrete approximations of Conley’s Lyapunov function. This is a natural framework i...
متن کاملDiscretisation of heterogeneous and anisotropic diffusion problems
A symmetric discretisation scheme for heterogeneous anisotropic diffusion problems on general meshes is developed and studied. The unknowns of this scheme are the values at the centre of the control volumes and at some internal interfaces which may for instance be chosen at the diffusion tensor discontinuities. The scheme is therefore completely cell-centred if no edge unknown is kept. It is sh...
متن کاملImproved Landau Gauge Fixing and Discretisation Errors ∗
Gauge fixing in lattice gauge theory simulations is crucial for many calculations e.g. the study of gauge dependent quantities such as the gluon propagator [1]. However, the standard lattice Landau gauge condition [2] is the same as the continuum condition, ∑ μ ∂μAμ = 0, only to leading order in the lattice spacing, a. The focus of this talk is to use mean-fieldimproved perturbation theory [3] ...
متن کاملEquivalence and Discretisation in Bio-PEPA
Bio-PEPA is a process algebra for modelling biological systems. An important aspect of Bio-PEPA is the ability it provides to discretise concentrations resulting in a smaller, more manageable state space. The discretisation is based on a step size which determines the size of each discrete level and also the maximum number of levels. This paper considers the relationship between two discretisat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1997
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700030537